Convergence of algebraic multigrid based on smoothed aggregation

نویسندگان

  • Petr Vanek
  • Marian Brezina
  • Jan Mandel
چکیده

We prove a convergence estimate for the Algebraic Multigrid Method with prolongations deened by aggregation using zero energy modes, followed by a smoothing. The method input is the problem matrix and a matrix of the zero energy modes. The estimate depends only polylogarithmically on the mesh size, and requires only a weak approximation property for the aggregates, which can be a-priori veriied computationally. Construction of the prolongator in the case of a general second order system is described, and the assumptions of the theorem are veriied for a scalar problem discretized by linear conforming nite elements.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of an Algebraic Petrov-Galerkin Smoothed Aggregation Multigrid Method

We give a convergence estimate for a Petrov-Galerkin Algebraic Multigrid method. In this method, the prolongations are defined using the concept of smoothed aggregation while the restrictions are simple aggregation operators. The analysis is carried out by showing that these methods can be interpreted as variational Ritz-Galerkin ones using modified transfer and smoothing operators. The estimat...

متن کامل

Algebraic Collocation Coarse Approximation (acca) Multigrid

Most algebraic multigrid (AMG) methods define the coarse operators by applying the (Petrov-)Galerkin coarse approximation where the sparsity pattern and operator complexity of the multigrid hierarchy is dictated by the multigrid prolongation and restriction. Therefore, AMG algorithms usually must settle on some compromise between the quality of these operators and the aggressiveness of the coar...

متن کامل

Adaptive Smoothed Aggregation (αSA)

Substantial effort has been focused over the last two decades on developing multilevel iterative methods capable of solving the large linear systems encountered in engineering practice. These systems often arise from discretizing partial differential equations over unstructured meshes, and the particular parameters or geometry of the physical problem being discretized may be unavailable to the ...

متن کامل

Reducing complexity of algebraic multigrid by aggregation

In order to decrease computational costs and memory requirements of relatively expensive classical algebraic multigrid (AMG) methods, we investigate its combination with aggressive coarsening schemes based on the plain (non-smoothed) aggregation on a fixed number of fine levels. Equivalently, we replace the direct solver on the coarsest level of the aggregation method with an inexact classical ...

متن کامل

Toward an h-Independent Algebraic Multigrid Method for Maxwell's Equations

We propose a new algebraic multigrid (AMG) method for solving the eddy current approximations to Maxwell’s equations. This AMG method has its roots in an algorithm proposed by Reitzinger and Schöberl. The main focus in the Reitzinger and Schöberl method is to maintain null-space properties of the weak ∇ × ∇× operator on coarse grids. While these null-space properties are critical, they are not ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Numerische Mathematik

دوره 88  شماره 

صفحات  -

تاریخ انتشار 2001